Alternating Krylov subspace image restoration methods

نویسندگان

  • J. O. Abad
  • Serena Morigi
  • Lothar Reichel
  • Fiorella Sgallari
چکیده

Alternating methods for image deblurring and denoising have recently received considerable attention. The simplest of these methods are two-way methods that restore contaminated images by alternating between deblurring and denoising. This paper describes Krylov subspace-based two-way alternating iterative methods that allow the application of regularization operators different from the identity in both the deblurring and the denoising steps. Numerical examples show that this can improve the quality of the computed restorations. The methods are particularly attractive when matrix-vector products with a discrete blurring operator and its transpose can be evaluated rapidly, but the structure of these operators does not allow inexpensive diagonalization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cascadic Alternating Krylov Subspace Image Restoration Method

This paper describes a cascadic image restoration method which at each level applies a two-way alternating denoising and deblurring procedure. Denoising is carried out with a wavelet transform, which also provides an estimate of the noise-level. The latter is used to determine a suitable regularization parameter for the Krylov subspace iterative deblurring method. The cascadic multilevel method...

متن کامل

Majorization-minimization generalized Krylov subspace methods for lp-lq optimization applied to image restoration

A new majorization-minimization framework for lp-lq image restoration is presented. The solution is sought in a generalized Krylov subspace that is build up during the solution process. Proof of convergence to a stationary point of the minimized lp-lq functional is provided for both convex and nonconvex problems. Computed examples illustrate that high-quality restorations can be determined with...

متن کامل

On Some Extended Block Krylov Based Methods for Large Scale Nonsymmetric Stein Matrix Equations

In the present paper, we consider the large scale Stein matrix equation with a low-rank constant term AXB − X + EFT = 0. These matrix equations appear in many applications in discrete-time control problems, filtering and image restoration and others. The proposed methods are based on projection onto the extended block Krylov subspace with a Galerkin approach (GA) or with the minimization of the...

متن کامل

Sylvester Tikhonov - regularization methods in image restoration

In this paper, we consider large-scale linear discrete ill-posed problems where the right-hand side contains noise. Regularization techniques such as Tikhonov regularization are needed to control the effect of the noise on the solution. In many applications such as in image restoration the coefficient matrix is given as a Kronecker product of two matrices and then Tikhonov regularization proble...

متن کامل

Krylov subspace iterative methods for nonsymmetric discrete ill-posed problems in image restoration

The BiCG and QMR methods are well-known Krylov subspace iterative methods for the solution of linear systems of equations with a large nonsymmetric, nonsingular matrix. However, little is known of the performance of these methods when they are applied to the computation of approximate solutions of linear systems of equations with a matrix of ill-determined rank. Such linear systems are known as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Computational Applied Mathematics

دوره 236  شماره 

صفحات  -

تاریخ انتشار 2012